Image processing method, system, and apparatus for facilitating data transmission

ABSTRACT

An image processing method for facilitating data transmission is provided. An image compression method is performed to convert X-bits binary digital signals to a binary compressed data in a floating-point form of (1.n)*2 m . Bit m represents the first bit with logic level “ 1 ” of the X-bits binary digital signals, and n represents the bits taken from the X-bits binary digital signals after the bit m. The binary compressed data in the floating-point form of (1.n)*2 m  is outputted with a sequence of binary number representing a set of (m, n). The latter n bits of the sequence of binary numbers are consisted of the n bits of the X-bits digital signal. Therefore, by the present image compression method, the transmission amount of image data is reduced. The transmission time of image data and the volume of a memory for storing the image data are also reduced.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to an image processing method, and moreparticularly, to an image compression method for binary digital signals.

2. Description of the Prior Art

Without image compression, the transmission of images requires anunacceptable bandwidth in many applications. As a result, methods ofcompressing images have been the subject of numerous researchpublications. Image compression schemes convert an image consisting of atwo-dimensional array of pixels into a sequence of bits, which are to betransmitted over a communication link. Each pixel represents theintensity of the image at a particular location therein. Thetransmission link may be an ordinary telephone line.

Consider an image comprising a gray-scale representation of a photographat a resolution of 1000×1000 lines. Each pixel typically consists of 8bits, which are used to encode 256 possible intensity levels at thecorresponding point on the photograph. Hence, without compression,transmission of the photograph requires that 8 million bits be sent overthe communication link. A typical telephone line is capable oftransmitting about 9600 bits per second; hence the picture transmissionwould require more than 10 minutes. Transmission times of this magnitudeare unacceptable.

As a result, image compression systems are needed to reduce thetransmission time. It will also be apparent to those skilled in the artthat image compression systems may also be advantageously employed inimage storage systems to reduce the amount of memory needed to store oneor more images.

Image compression involves transforming the image to a form, which canbe represented in fewer bits without losing the essential features ofthe original images. The transformed image is then transmitted over thecommunication link and the inverse transformation is applied at thereceiver to recover the image. The compression of an image typicallyrequires two steps. In the first step, the image is transformed to a newrepresentation in which the correlation between adjacent pixels isreduced. This transformation is usually completely reversible, that is,no information is lost at this stage. The number of bits of data neededto represent the transformed image is at least as large as that neededto represent the original image. The purpose of this transformation isto provide an image representation, which is more ideally suited toknown compression methods.

In the second step, referred to as quantization, each pixel in thetransformed image is replaced by a value, which is represented in fewerbits, on average, than the original pixel value. In general, theoriginal gray scale is replaced by a new scale, which has coarser stepsand hence can be represented in fewer bits. The new gray scale iscalculated from the statistical distribution of the pixel values in thetransformed image.

The quantized image resulting from the above two steps is often furthercoded for transmission over the communication link. This coding iscompletely reversible. Its purpose is to provide a more compactrepresentation of the quantized picture. At the other end of thecommunication link, the coded image is decoded, the quantizationtransformation is reversed and the inverse of the first transformationis performed on the resulting image to provide a reconstructed image.

However, the known image compression method usually utilizes acomplicated encoding and decoding circuitry to attain the more compactimage data for transmission. The coding/decoding process is alsocomplicated. Moreover, the image transformation circuitry is asignificant cost factor in image compression apparatuses. The requiredcomputational expense clearly depends on the image transformationselected. Hence, an image compression method, which requires lesscomputation than the prior image compression method, would beadvantageous.

SUMMARY OF THE INVENTION

It is one objective of the present invention to provide an imageprocessing method for facilitating data transmission, which performs animage compression method for converting X-bits binary digital signals toa binary compressed data in a floating-point form of (1.n)*2^(m), inwhich bit m represents the first bit with logic level “1” of the X-bitsbinary digital signals, and n represents the bits taken from the X-bitsbinary digital signals after the bit m. The binary compressed data inthe floating-point form of (1.n)*2^(m) is outputted with a sequence ofbinary number representing a set of (m, n). The latter n bits of thesequence of binary numbers are consisted of the n bits of the X-bitsbinary digital signals. Therefore, the transmission amount of image datais reduced, and the transmission rate of the image data is facilitated.

It is another objective of the present invention to provide an imageprocessing method for facilitating data transmission, which implements asimple compression method to convert X-bits binary digital signals to abinary compressed data in a floating-point form of (1.n)*2^(m). Thecomplicated encoding and decoding processes for image compression andprocessing circuits therefore are omitted by the present compressionmethod.

It is a further objective of the present invention to provide an imageprocessing method, which performs a bit-enhanced technology tocompensate decompressed image data to increase the accuracy of therecovery of the image data.

It is still further an objective of the present invention to provide animage processing method, which uses a simple image compression method toobtain the purpose of making the recovered image with low grayscalelevel non-distorted and the recovered image with high grayscale levelnoise-eliminated.

In order to achieve the above objectives of this invention, the presentinvention provides an image processing method for facilitating datatransmission. The present method comprises capturing an image signalfrom an object with an image capture device, and providing the imagesignal to an analog-to-digital converter for converting the image signalto X-bits binary digital signals consisted of bit (X-1) to bit 0,wherein X is a natural number. Then, the X-bits binary digital signalsis transmitted to image processing means for compressing the X-bitsbinary digital signals to a binary compressed data in a floating-pointform of (1.n)*2^(m). Bit m represents the first bit with logic level “1”of the X-bits binary digital signals, and n represents the bits takenfrom the X-bits binary digital signals after the bit m, n is anon-negative integer. The binary compressed data in the floating-pointform of (1.n)*2^(m) is outputted with a sequence of binary numberrepresenting a set of (m, n), and the latter n bits of the sequence ofbinary numbers are consisted of the n bits of the X-bits binary digitalsignals. The binary compressed data is then transmitted to memory meansfor storage. By the present image compression method, the transmissionamount of image data is reduced. The transmission rate of image data isfacilitated and the volume of a memory for storing the image data isalso reduced.

BRIEF DESCRIPTION OF THE DRAWINGS

The objectives and features of the present invention as well asadvantages thereof will become apparent from the following detaileddescription, considered in conjunction with the accompanying drawings.

FIG. 1 is a block diagram of an image processing system implementingimage compression methods of the present invention;

FIG. 2 is a block diagram of another image processing systemimplementing the image compression methods of the present invention;

FIG. 3 is a flow chart of one embodiment of the present inventionillustrating the present image compression method; and

FIG. 4 is a flow chart for illustrating an image decompression processof the present invention.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

Referring to the figures, exemplary embodiments of the invention willnow be described. The exemplary embodiments are provided to illustrateaspects of the invention and should not be construed as limiting thescope of the invention. The exemplary embodiments are primarilydescribed with reference to block diagrams and flowcharts.

FIG. 1 is a block diagram of an image processing system implementingimage compression methods of the present invention, and FIG. 2 is ablock diagram of another image processing system implementing the imagecompression methods of the present invention. FIG. 3 is a flow chart ofone embodiment of the present invention illustrating the present imagecompression method. FIG. 4 is a flow chart for illustrating an imagedecompression process of the present invention.

Initially, referring to FIG. 1, an image is captured from an object byan image capture device 101, e.g. charge-coupled device (CCD), CMOSsensor and the like capable of converting an image signal to an electricsignal. The image signal represents intensity of a pixel of the imagecaptured by the image capture device 101. The electric signal is thenprovided to an A/D converter (analog-to-digital converter) 102 toconvert to X-bits binary digital signals, which are consisted of binaryvalues from bit (X-1) to bit 0. The X-bits binary digital signals aretransmitted to image processing means 103 for being compressed to abinary compressed data in a floating-point form of (1.n)*2^(m), whereinbit m represents the first bit with logic level “1” of the X-bits binarydigital signals, and n represents the bits taken from the X-bits binarydigital signals after the bit m, n is a non-negative integer. Hence, byimage processing means 103, e.g. an image processing circuit, the X-bitsbinary digital signals are converted to the binary compressed data inthe floating-point form of (1.n)*2^(m), which is outputted with asequence of binary number, (x x x . . . , x), representing a set of (m,n). The latter n bits of the sequence of binary numbers are consisted ofthe n bits of the X-bits binary digital signals. The binary compresseddata is then transmitted with the sequence of binary numbers, (x x . . ., x), representing the set of (m, n), to a memory 104, e.g. a buffermemory, for storage.

FIG. 3 is a flow chart of one embodiment of the present inventionillustrating the image compression process for 8-bits binary digitalsignals implemented by image processing means 103. The image compressionprocess of the embodiment for 8-bits binary digital signals will bedescribed in detail in the following. In step 303, the 8-bits binarydigital signals consisted of binary values from bit 7 to bit 0 isprovided to image processing means 103. In step 304, when bit 7 is logiclevel “1”, go to step 305, m is set to 7 and n is assigned from bit 6 tobit 3 of the 8-bits binary digital signals. Then, the 8-bits binarydigital signals are converted to a binary compressed data in afloating-point form of (1.xxxx)*2⁷. The binary compressed data isoutputted with 7-bits binary numbers, (1 1 1 x x x x). The former 3 bitsof the 7-bits binary numbers represent the value of 7 and the latter 4bits of the 7-bits binary numbers are consisted of bit 6 to bit 3 of the8-bits binary digital signals. In step 306, when bit 7 is logic level“0” and bit 6 is logic level “1”, go to step 307, m is set to 6 and n isassigned from bit 5 to bit 2 of the 8-bits binary digital signals. Then,the 8-bits binary digital signals are converted to a binary compresseddata in a floating-point form of (1.xxxx)*2⁶. The binary compressed datais outputted with 7-bits binary numbers, (1 1 0 x x x x). The former 3bits of the 7-bits binary numbers represent the value of 6 and thelatter 4 bits of 7-bits binary numbers are consisted of bit 5 to bit 2of the 8-bits binary digital signals. In step 308, when both of bit 7and bit 6 are logic level “0”, and bit 5 is logic level “1”, go to step309, m is set to 5, and n is assigned from bit 4 to bit 1 of the 8-bitsbinary digital signals. Then, the 8-bits binary digital signals areconverted to a binary compressed data in a floating-point form of(1.xxxx)*2⁵. The binary compressed data is outputted with 7-bits binarynumbers, (1 0 1 x x x x). The former 3 bits of the 7-bits binary numbersrepresent the value of 5 and the latter 4 bits of 7-bits binary numbersare consisted of bit 4 to bit 1 of the 8-bits binary digital signals. Instep 310, when bit 7, bit 6 and bit 5 are logic level “0”, and bit 4 islogic level “1”, go to step 311, m is set to 4, and n is assigned frombit 3 to bit 0 of the 8-bits binary digital signals. Then, the 8-bitsbinary digital signals are converted to a binary compressed data in afloating-point form of (1.xxxx)*2⁴. The binary compressed data isoutputted with 7-bits binary numbers, (1 0 0 x x x x). The former 3 bitsof the 7-bits binary numbers represent the value of 4 and the latter 4bits of 7-bits binary numbers are consisted of bit 3 to bit 0 of the8-bits binary digital signals. In step 312, when bit 7, bit 6, bit 5 andbit 4 are logic level “0”, and bit 3 is logic level “1”, go to step 313,m is set to 3, n is assigned from bit 2 to bit 0 of the 8-bits binarydigital signals. Then, the 8-bits binary digital signals are convertedto a binary compressed data in a floating-point form of (1.xxx)*2³. Thebinary compressed data is outputted with 6-bits binary numbers, (0 1 1 xx x). The former 3 bits of the 6-bits binary numbers represent the valueof 3 and the latter 3 bits of the 6-bits binary numbers are consisted ofbit 2 to bit 0 of the 8-bits binary digital signals. In step 314, whenbit 7 to bit 3 are logic level “0”, and bit 2 is logic level “1”, go tostep 315, m is set to 2, n is assigned from bit 1 to bit 0 of the 8-bitsbinary digital signals. Then, the 8-bits binary digital signals areconverted to a binary compressed data in a floating-point form of(1.xx)*2². The binary compressed data is outputted with 5-bits binarynumbers, (0 1 0 x x). The former 3 bits of the 5-bits binary numbersrepresent the value of 2 and the latter 2 bits of the 5-bits binarynumbers are consisted of bit 2 to bit 0 of the 8-bits binary digitalsignals. In step 316, when bit 7 to bit 2 are logic level “0”, and bit 1is logic level “1”, go to step 317, m is set to 1, and n is assigned bit0 of the 8-bits binary digital signals. Then, the 8-bits binary digitalsignals are converted to a binary compressed data in a floating-pointform of (1.x)*2¹. The binary compressed data is outputted with 4-bitsbinary numbers, (0 0 1 x). The former 3 bits of the 4-bits binarynumbers represent the value of 1 and the last bit of the 4-bits binarynumbers is bit 0 of the 8-bits binary digital signals. In step 318, whenbit 7 to bit 1 is logic level “0”, and bit 0 is logic level “1”, m isset to 0, and n is assigned bit 0 of the 8-bits binary digital signals.Then, the 8-bits binary digital signals are converted to a binarycompressed data in a floating-point form of (1.x)*2⁰. The binarycompressed data is outputted with 4-bits binary numbers, (0 0 0 x). Theformer 3 bits of the 4-bits binary numbers represent the value of 0 andthe last bit of the 4-bits binary numbers is bit 0 of the 8-bits binarydigital signals.

According to the embodiment of the present invention, the presentinvention provides a dynamic compression method, in which when m≧4, thebinary compressed data is outputted with 7-bit binary numbers, and whenm≦3, the binary compressed data can be outputted with fewer bits, suchas 6 bits, 5 bits and 4 bits. Hence, transmission amount of the imagedata transmitted to the memory 104 and the host 105 is reduced. Thetransmission time of the image data is thus decreased, and the volume ofthe memory 104 for storing the image data is also reduced. However, thepresent compression method is also suited to compress binary digitalsignals consisted of 10-bits, 12-bits and 16-bits, etc. And, n isdetermined according to quality of the image desired. TABLE I Beforecompression After compression Recovery 0000,0000 000 0 0000,00000000,0001 000 1 0000,0001 0000,0010 001 0 0000,0010 0000,0011 001 10000,0011 0000,0100 010 00 0000,0100 0010,1000 101 0100 0010,10000010,1001 101 0100 0010,1000 0010,1010 101 0101 0010,1010 0100,0000 1100000 0100,0000 0100,0010 110 0000 0100,0000 0100,0100 110 0001 0100,01001111,1011 111 1111 1111,1000 1111,1100 111 1111 1111,1000 1111,1101 1111111 1111,1000 1111.1110 111 1111 1111,1000

The above table I lists respective results before compression, aftercompression and after recovery for 8-bits binary digital signals. The7-bits binary compressed data in table I are generated from thecompression method according to the embodiment illustrated in FIG. 3.The value of m is represented by the former 3 bits of the 7-bit binarycompressed data and n is the latter 4 bits of the 7-bits binarycompressed data. As shown in table I, the higher the grayscale level ofthe pixel is, the higher the distortion of the recovered image data is.Thus, a decompression method of the present invention utilizing abit-enhanced technology (BET) is provided to compensate loss of therecovered image data, which is illustrated in FIG. 4.

Referring to FIG. 1 again, the binary compressed data from thecompression method of FIG. 3 and stored in the memory 104 is thenoutputted to a host 105 for further processing, such as decompressing torecover the original 8-bits binary digital signals and print out. Thedecompression method of the present invention illustrated in FIG. 4 isimplemented in the host 105. In step 403, converting the former 3 bitsof the 7-bits binary compressed data to an “x” value. In step 404, whenx>3, and x is a non-negative integer, go to step 405, converting thelatter 4 bits of the 7-bits binary compressed data to an “y” value. Inaccordance with the values of x and y, and the logarithm form(1.y)*2^(x), recovering the 7-bits binary compressed data to theoriginal 8-bits binary digital signals. Then, go to step 414, abit-enhanced method is applied to the recovered image data from step405. The bit-enhanced method comprises steps of (a) calculating a firstaverage of a plurality of neighboring pixels around the pixelcorresponding to the recovered 8-bits binary digital signals; and (b)calculating a second average of the first average and the pixel. As aresult, the compensated data of the pixel is obtained. In step 406, whenx>2, go to step 407, converting the latter 3 bits of the 6-bits binarycompressed data to an “y” value. In accordance with the values of x andy, and the logarithm form (1.y)*2^(x), recovering the 6-bits binarycompressed data to the original 8-bits binary digital signals. Then, goto step 414, the bit-enhanced method is applied to the recovered imagedata from step 407. In step 408, when x>1, go to step 409, convertingthe latter 2 bits of the 5-bits binary compressed data to an “y” value.In accordance with the values of x and y, and the logarithm form(1.y)*2^(x), recovering the 5-bits binary compressed data to theoriginal 8-bits binary digital signals. Then, go to step 414, thebit-enhanced method is applied to the recovered image data from step409. In step 410, when x>0, go to step 411, converting the latter 1 bitof the 4-bits binary compressed data to an “y” value. In accordance withthe values of x and y, and the logarithm form (1.y)*2^(x), recoveringthe 4-bits binary compressed data to the original 8-bits binary digitalsignals. Then, go to step 414, the bit-enhanced method is applied to therecovered image data from step 411. In step 412, when x=0, convertingthe last bit of the 4-bit binary compressed data to an “y” value. Inaccordance with the values of x and y, and the logarithm form(1.y)*2^(x), recovering the 1-bits binary compressed data to theoriginal 8-bits binary digital signals.

FIG. 2 is a block diagram of another image processing systemimplementing the present image compression method, in which the binarycompressed data stored in the memory 104 is accessed by image processingmeans 103, and then outputted to the host 105 for further processing,such as decompressing to recover the original image data. Since the datacommunication between image processing means 103, the memory 104 and thehost 105 is in the form of the binary compressed data, the transmissionamount of the image data between them is reduced, and the transmissiontime of the image data is therefore reduced.

With reference to table I again, the recovered image data of a pixelwith a low grayscale level is less distorted, and the recovered imagedata of a pixel with a higher grayscale level is more distorted.Therefore, a purpose for making the recovered image of a black-areaimage, i.e. image with low grayscale levels, non-distorted, and therecovered image of a white-area image, i.e. image with high grayscalelevels, noise-eliminated, is obtained in accordance with the presentimage compression method of FIG. 3.

The embodiments are only used to illustrate the present invention, notintended to limit the scope thereof. Many modifications of theembodiments can be made without departing from the spirit of the presentinvention.

1-7. (canceled)
 8. A system comprising: an image capture device capableof generating a signal based at least in part on an image of an object;an image processor capable of converting an X-bit binary signal to abinary compressed data in a form of (1.n)*2^(m), wherein said X-bitbinary signal is based at least in part on the generated signal, whereinX comprises a natural number, and wherein a bit m represents the firstbit with logic level “1” of said X-bit-binary signal, and n representsthe bits taken from said X-bit binary signal after the bit m, andwherein n comprises a non-negative integer.
 9. The system of claim 9,further comprising an analog to digital converter capable of convertingsaid generated signal to said X-bit binary signal.
 10. The system ofclaim 8, wherein said binary compressed data comprises a sequence ofbinary numbers representing a set of (m, n) and a latter n bits of thesequence of binary numbers comprising said n bits of said X-bit binarysignal.
 11. The system of claim 10, wherein said image processor isfurther capable of storing said binary compressed data in a memory. 12.The system of claim 11, further comprising a host, wherein said host iscapable of accessing said binary compressed data from said memory atleast in part for decompressing said binary compressed data to recoversaid X-bit binary signal.
 13. The system of claim 12, whereindecompressing said binary compressed data comprises: converting one ormore bits of said binary compressed data before a latter n bits of saidbinary compressed data to the value of m; and recovering said binarycompressed data to said X-bit binary signals in accordance with saidlatter n bits, the value of m and the algorithm form of (1.n)*2^(m). 14.The system of claim 13, wherein said host is further capable ofcompensating a pixel corresponding to said X-bits binary signal with abit-enhanced method at least in part by calculating a first average of aplurality of neighboring pixels around said pixel; and calculating asecond average of said first average and said pixel.
 15. An apparatuscomprising: an image processor capable of converting an X-bit binarysignal to a binary compressed data in a form of (1.n)*2^(m), whereinsaid X-bit binary signal is based at least in part on the generatedsignal, wherein X comprises a natural number, and wherein a bit mrepresents the first bit with logic level “1” of said X-bit binarysignal, and n represents the bits taken from said X-bit binary signalafter the bit m, and wherein n comprises a non-negative integer.
 16. Theapparatus of claim 15, wherein said binary compressed data comprises asequence of binary numbers representing a set of (m, n) and a latter nbits of the sequence of binary numbers comprising said n bits of saidX-bit binary signal.
 17. The apparatus of claim 16, wherein said imageprocessor is further capable of storing said binary compressed data in amemory.
 18. A method, comprising: converting an X-bit binary signal to abinary compressed data in a form of (1.n)*2^(m), wherein said X-bitbinary signal is based at least in part on a signal generated by animage capture device, wherein X comprises a natural number, and whereina bit m represents the first bit with logic level “1” of said X-bitbinary signal, and n represents the bits taken from said X-bit binarysignal after the bit m, and wherein n comprises a non-negative integer.19. The method of claim 18, wherein said binary compressed datacomprises a sequence of binary numbers representing a set of (m, n) anda latter n bits of the sequence of binary numbers comprising said n bitsof said X-bit binary signal.
 20. The method of claim 19, furthercomprising storing said binary compressed data in a memory.
 21. Themethod of claim 20, further comprising accessing said binary compresseddata from said memory at least in part for decompressing said binarycompressed data to recover said X-bit binary signal.
 22. The method ofclaim 21, wherein decompressing said binary compressed data comprises:converting one or more bits of said binary compressed data before alatter n bits of said binary compressed data to the value of m; andrecovering said binary compressed data to said X-bit binary signals inaccordance with said latter n bits, the value of m and the algorithmform of (1.n)*2^(m).
 23. The method of claim 22, further comprisingcompensating a pixel corresponding to said X-bits binary signal with abit-enhanced method at least in part by calculating a first average of aplurality of neighboring pixels around said pixel; and calculating asecond average of said first average and said pixel.
 24. A systemcomprising: means for generating a signal based on an image of anobject; means for converting said signal to an X-bit binary signal;means for compressing said X-bit binary signal into binary compresseddata in a form of (1.n)*2^(m), wherein said X-bit binary signal is basedat least in part on a signal generated by an image capture device,wherein X comprises a natural number, and wherein a bit m represents thefirst bit with logic level “1” of said X-bit binary signal, and nrepresents the bits taken from said X-bit binary signal after-the bit m,and wherein n comprises a non-negative integer.
 25. The system of claim24, wherein said binary compressed data comprises a sequence of binarynumbers representing a set of (m, n) and a latter n bits of the sequenceof binary numbers comprising said n bits of said X-bit binary signal.26. The system of claim 25, further comprising means for storing saidbinary compressed data in a memory.
 27. The system of claim 26, furthercomprising: means for accessing said binary compressed data from saidmemory; and means for decompressing said binary compressed data torecover said X-bit binary signal.
 28. The system of claim 27, whereindecompressing said binary compressed data comprises: converting one ormore bits of said binary compressed data before a latter n bits of saidbinary compressed data to the value of m; and recovering said binarycompressed data to said X-bit binary signals in accordance with saidlatter n bits, the value of m and the algorithm form of (1.n)*2^(m). 29.The system of claim 28, further comprising means for compensating apixel corresponding to said X-bits binary signal with a bit-enhancedmethod at least in part by calculating a first average of a plurality ofneighboring pixels around said pixel and calculating a second average ofsaid first average and said pixel.
 30. An article comprising: a storagemedia having stored thereon instructions that if executed result in:converting an X-bit binary signal to a binary compressed data in a formof (1.n)*2^(m), wherein said X-bit binary signal is based at least inpart on a signal generated by an image capture device, wherein Xcomprises a natural number, and wherein a bit m represents the first bitwith logic level “1” of said X-bit binary signal, and n represents thebits taken from said X-bit binary signal after the bit m, and wherein ncomprises a non-negative integer.
 31. The article of claim 30, whereinsaid binary compressed data comprises a sequence of binary numbersrepresenting a set of (m, n) and a latter n bits of the sequence ofbinary numbers comprising said n bits of said X-bit binary signal. 32.The article of claim 31, wherein said instructions if executed furtherresult in storing said binary compressed data in a memory.
 33. Thearticle of claim 32, wherein said instructions if executed furtherresult in accessing said binary compressed data from said memory atleast in part for decompressing said binary compressed data to recoversaid X-bit binary signal.
 34. The article of claim 33, whereindecompressing said binary compressed data comprises: converting one ormore bits of said binary compressed data before a latter n bits of saidbinary compressed data to the value of m; and recovering said binarycompressed data to said X-bit binary signals in accordance with saidlatter n bits, the value of m and the algorithm form of (1.n)*2^(m). 35.The article of claim 34, wherein said instructions if executed furtherresult in compensating a pixel corresponding to said X-bits binarysignal with a bit-enhanced method at least in part by calculating afirst average of a plurality of neighboring pixels around said pixel;and calculating a second average of said first average and said pixel.